A Limitation of Vector Timestamps for Reconstructing Distributed Computations
نویسنده
چکیده
Vector timestamps provide a way of recording the causal relationships between events in a distributed computation. We draw attention to a limitation of such timestamps when used to reconstruct computations in which message overtaking occurred.
منابع مشابه
Timestamping Messages in Synchronous Computations
Determining order relationship between events in distributed computations is a fundamental problem with applications in distributed monitoring systems and faulttolerance. Fidge and Mattern’s vector clocks capture the order relationship with vectors of size N in a system with N processes. Since many distributed applications use synchronous messages, it is natural to ask if the overhead can be re...
متن کاملA Hierarchical Cluster Algorithm for Dynamic, Centralized Timestamps
Partial-order data structures used in distributed-system observation tools typically use vector timestamps to efficiently determine event precedence. Unfortunately, all current dynamic vector-timestamp algorithms either require a vector of size equal to the number of processes in the computation or require a graph search operation to determine event precedence. This fundamentally limits the sca...
متن کاملComprehensive Distributed Garbage Collection by Tracking Causal Dependencies of Relevant Mutator Events
Comprehensive distributed garbage collection an objectoriented distributed systems has mostly been addressed via distributed versions of graph-tracing algorithms, a legacy of centralised garbage collection techniques. Two features jeopardise the scalability of these approaches: the bottleneck associated with having t o reach a global consensus before any resource can actually be reclaimed, and ...
متن کاملLinear Space Algorithm for On - line Detectionof Global
A fundamental problem in debugging and monitoring is detecting whether the state of a system satisses some predicate. Cooper and Marzullo deened this problem as Possibly() for distributed computations. This paper presents the rst on{line algorithm using linear space which resolve this problem in the general case, improving all existing algorithms both in time and space. It is particularly inter...
متن کاملA framework algorithm for dynamic, centralized dimension-bounded timestamps
Vector timestamps can be used to characterize causality in a distributed computation. This is essential in an observation context where we wish to reason about the partial order of execution. Unfortunately, all current dynamic vector-timestamp algorithms require a vector of size equal to the number of processes in the computation. This fundamentally limits the scalability of such observation sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 68 شماره
صفحات -
تاریخ انتشار 1998